Visualizing Hierarchical Clustering in Iterated Logarithmic Scales
نویسنده
چکیده
Clustering data has been of great interest to many researchers. Hierarchical clustering methods have been preferred because clusters can be visualized as a dendrogram. One of the problems of hierarchical clustering methods, however, is that the resulting dendrogram is not visually pleasing due to the scaling problem. Hence, a series of iterated logarithmic function is proposed so as to mitigate the scaling problem. Theoretical properties of the iterated logarithmic function are presented.
منابع مشابه
Recursive Similarity Hashing of Fractal Geometry
A new technique of topological multi-scale analysis is introduced. By performing a clustering recursively to build a hierarchy, and analyzing the co-scale and intra-scale similarities, an Iterated Function System can be extracted from any data set. The study of fractals shows that this method is efficient to extract self-similarities, and can find elegant solutions the inverse problem of buildi...
متن کاملPoster: Visualizing Schema Clusters for Agile Information Sharing
Very large enterprises present distinct information management challenges: it is difficult for their Chief Information Officers (CIOs) and information architects to obtain a clear overview of enterprise information assets and it is hard to quickly recognize opportunities for productive data sharing. To support users in these endeavors, we have created Affinity, a tool for visualizing clusters o...
متن کاملClassification and visualization of the social science network by the minimum span clustering method
We propose a minimum span clustering (MSC) method for clustering and visualizing complex networks using the interrelationship of network components. To demonstrate this method, it is applied to classify the social science network in terms of aggregated journal-journal citation relations of the Institute of Scientific Information (ISI) Journal Citation Reports. This method of network classificat...
متن کاملHierarchical Density-Based Clustering of White Matter Tracts in the Human Brain
Diffusion tensor magnetic resonance imaging (DTI) provides a promising way of estimating the neural fiber pathways in the human brain non-invasively via white matter tractography. However, it is difficult to analyze the vast number of resulting tracts quantitatively. Automatic tract clustering would be useful for the neuroscience community, as it can contribute to accurate neurosurgical plannin...
متن کاملHierarchical Fiber Clustering Based on Multi-Scale Neuroanatomical Features
DTI fiber tractography inspires unprecedented understanding of brain neural connectivity by allowing in vivo probing of the brain white-matter microstructures. However, tractography algorithms often output hundreds of thousands of fibers and thus render the fiber analysis a challenging task. By partitioning a huge number of fibers into dozens of bundles, fiber clustering algorithms make the tas...
متن کامل